EXPEDIS: An exact penalty method over discrete sets
نویسندگان
چکیده
We address the problem of minimizing a quadratic function subject to linear constraints over binary variables. introduce exact solution method called EXPEDIS where constrained is transformed into max-cut instance, and then thewhole machinery available for can be used solve problem. derive theory in order find transformation spirit an penalty method; however, we are only interested exactness set In compute maximum cut use solver BiqMac. Numerical results show that this algorithm successfully applied on various classes problems.
منابع مشابه
Quantumlike Diffusion over Discrete Sets
In the present paper, a discrete differential calculus is introduced and used to describe dynamical systems over arbitrary graphs. The discretization of space and time allows the derivation of Heisenberg-like uncertainty inequalities and of a Schrödinger-like equation of motion, without need of any quantization procedure. Ever since the seminal work of Regge [1] on gravity, discretization has b...
متن کاملExact Penalty Principle∗
Exact penalty approach aims at replacing a constrained optimization problem by an equivalent unconstrained optimization problem. Most of results in the literature of exact penalization are mainly concerned with finding conditions under which a solution of the constrained optimization problem is a solution of an unconstrained penalized optimization problem and the reverse property is rarely stud...
متن کاملExact Penalty Methods
Exact penalty methods for the solution of constrained optimization problems are based on the construction of a function whose unconstrained minimizing points are also solution of the constrained problem. In the rst part of this paper we recall some deenitions concerning exactness properties of penalty functions, of barrier functions, of augmented Lagrangian functions, and discuss under which as...
متن کاملAn Exact Method for a Discrete Multiobjective Linear Fractional Optimization
Integer linear fractional programming problem with multiple objective MOILFP is an important field of research and has not received as much attention as did multiple objective linear fractional programming. In this work, we develop a branch and cut algorithm based on continuous fractional optimization, for generating the whole integer efficient solutions of the MOILFP problem. The basic idea of...
متن کاملA line search exact penalty method using steering rules
Line search algorithms for nonlinear programming must include safeguards to enjoy global convergence properties. This paper describes an exact penalization approach that extends the class of problems that can be solved with line search SQP methods. In the new algorithm, the penalty parameter is adjusted at every iteration to ensure sufficient progress in linear feasibility and to promote accept...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2022
ISSN: ['1873-636X', '1572-5286']
DOI: https://doi.org/10.1016/j.disopt.2021.100622